Scheduling Of Uniform Processors With Memory *
نویسندگان
چکیده
We consider the problem of preemptively scheduling n jobs on a system of m uniform processors. Each job has a release time, a due time, and a memory requirement associated with it. Each processor has a speed and a memory capacity associated with it. Linear programming formulations are obtained for the following optimization criteria: (1) minimize the schedule length and (2) minimize the maximum lateness. We also consider three special cases with the former optimization criteria. For each of these cases, low order polynomial time algorithms are obtained.
منابع مشابه
LOCALITY AND LOOP SCHEDULING ON NUMAMULTIPROCESSORSHui
An important issue in the parallel execution of loops is how to partition and schedule the loops onto the available processors. While most existing dynamic scheduling algorithms manage load imbalances well, they fail to take locality into account and therefore perform poorly on parallel systems with non-uniform memory access times. In this paper, we propose a new loop scheduling algorithm, Loca...
متن کاملClustered affinity scheduling on large-scale NUMA multiprocessors
Modern shared-memory multiprocessors have high and non-uniform memory access (NUMA) costs. The communication cost gradually dominates the source of parallel applications’ execution. Algorithms based on affinity, like affinity scheduling algorithm (AFS), perform better than dynamic algorithms, such as guided self-scheduling (GSS) and trapezoid selfscheduling (TSS). However, as the number of proc...
متن کاملPerformance Prediction and Evaluation of Parallel Processing on a NUMA Multiprocessor
Non-Uniform Memory Access (NUMA) architectures make it possible to build large-scale shared memory multiprocessor systems in comparison with non-scalable UniformMemory Access (UMA) architectures. Most NUMA multiprocessor operations such as scheduling and synchronizing processes, accessing data from processors to memory models and allocating distributed memory space to di erent processors, are p...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملCombining Dynamic and Static Scheduling on Distributed-Memory Multiprocessors
Loops are a large source of parallelism for many numerical applications. An important issue in the parallel execution of loops is how to schedule them so that the work-load is well balanced among the processors. Most existing loop scheduling algorithms were designed for shared-memory multiprocessors, with uniform memory access costs. These approaches are not suitable for distributed-memory mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1981